A combinatorial model for the path fibration
نویسندگان
چکیده
منابع مشابه
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
the use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولA duality for the double fibration transform
We establish a duality within the spectral sequence that governs the holomorphic double fibration transform. It has immediate application to the questions of injectivity and range characterization for this transform. We discuss some key examples and an improved duality that holds in the Hermitian holomorphic case. 1. Double fibrations In this article we shall always work in the holomorphic cate...
متن کاملThe Wall Finiteness Obstruction for a Fibration
1. We wish to study the Wall finiteness obstruction for the total space of a fibration F → E → B. Such a study was first done by V. J. Lal [5], who neglected the action of π1(B) on the fibre. This was noticed by D. R. Anderson [2], who produced formulae for the finiteness obstruction of E in case the fibration is a flat bundle [2, 1]. Our main theorem gives a partial calculation of the general ...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Homotopy and Related Structures
سال: 2018
ISSN: 2193-8407,1512-2891
DOI: 10.1007/s40062-018-0216-4